|
In numerical analysis, Estrin's scheme (after Gerald Estrin), also known as Estrin's method, is an algorithm for numerical evaluation of polynomials. The Horner scheme for evaluation of polynomials is one of the most commonly used algorithms for this purpose and unlike Estrin's scheme it is optimal in the sense that it minimizes the number of multiplications and addition required to evaluate an arbitrary polynomial. On a modern processor architecture that allows out-of-order execution, instructions that do not depend on each other's results may run in parallel. The Horner scheme contains a series of multiplications and additions that depend on the previous instruction and so cannot execute in parallel. Estrin's scheme is one method that attempts to overcome this serialization while still being reasonably close to optimal. == Description of the algorithm == Given an arbitrary polynomial ''P''''n''(''x'')= ''C''0 + ''C''1''x'' + ''C''2''x''2 + ''C''3''x''3 + ... + ''C''''n''''x''''n'' one can isolate sub-expressions of the form (''A'' + ''Bx'') and of the form ''x''2''n''. Rewritten using Estrin's scheme we get ''P''''n''(''x'') = (''C''0 + ''C''1''x'') + (''C''2 + ''C''3''x'') ''x''2 + ((''C''4 + ''C''5x) + (''C''6 + ''C''7x) ''x''2))''x''4 + ... x2n can be evaluated once and kept until no longer required. As is evident from looking at this expression there are many sub-expression that may be evaluated in parallel. The sub-expressions of form (''A''+ ''Bx'') can be evaluated using a native multiply–accumulate instruction on some architectures, an advantage that is shared with the Horner scheme. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Estrin's scheme」の詳細全文を読む スポンサード リンク
|